Termination Proof Script
Consider the TRS R consisting of the rewrite rule
There are 2 dependency pairs:
|
| 2: |
|
F(x) |
→ F(f(x)) |
| 3: |
|
F(x) |
→ F(x) |
|
Consider the SCC {2,3}.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 4, 2006